Polygonal chains with minimal energy
نویسندگان
چکیده
منابع مشابه
Stabbing Polygonal Chains with Rays is Hard to Approximate
We study a geometric hitting set problem involving unirectional rays and curves in the plane. We show that this problem is hard to approximate within a logarithmic factor even when the curves are convex polygonal x-monotone chains. Additionally, it is hard to approximate within a factor of 76 even when the curves are line segments with bounded slopes. Lastly, we demonstrate that the problem is ...
متن کاملComputing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at two given points. In other words, given a set S of points in the plane and a positive value l0, we want to compute an anchored 1-corner polygonal chain having length at most l0 such that the minimum distance to the point...
متن کاملPlanar lower envelope of monotone polygonal chains
A simple linear search algorithm running in O(n+mk) time is proposed for constructing the lower envelope of k vertices from m monotone polygonal chains in 2D with n vertices in total. This can be applied to output-sensitive construction of lower envelopes for n arbitrary line segments in optimal O(n log k) time, where k is the output size. Compared to existing output-sensitive algorithms for lo...
متن کاملPolygonal chains cannot lock in 4d
We prove that, for all dimensions d 4, every simple open polygonal chain may be straightened, and every simple closed polygonal chain may be convexi ed. Both can be achieved by algorithms that use polynomial time in the number of vertices, and result in a polynomial number of \moves." These results contrast to those known for d = 3, where open and closed chains can be \locked."
متن کاملEfficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C ′ whose vertices are constrained to be a subset of the set of vertices of C . The goal is to minimize the number of vertices needed in the approximation C ′. Based on a framework introduced by Imai and Iri [25], we define an error criterion for measuring the quality of an approximation. We consider two pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2003
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(03)00540-8